Estimating the earthquake source parameters: Simulated anneling versus nelder- mead simplex algorihm
نویسندگان
چکیده
منابع مشابه
Implementing the Nelder-Mead simplex algorithm with adaptive parameters
In this paper, we first prove that the expansion and contraction steps of the Nelder-Mead simplex algorithm possess a descent property when the objective function is uniformly convex. This property provides some new insights on why the standard Nelder-Mead algorithm becomes inefficient in high dimensions. We then propose an implementation of the Nelder-Mead method in which the expansion, contra...
متن کاملNelder, Mead, and the Other Simplex Method
In the mid-1960s, two English statisticians working at the National Vegetable Research Station invented the Nelder–Mead “simplex” direct search method. The method emerged at a propitious time, when there was great and growing interest in computer solution of complex nonlinear real-world optimization problems. Because obtaining first derivatives of the function f to be optimized was frequently i...
متن کاملA Combined Nelder - Mead Simplex and Geneti
Ni olas Durand Laboratoire d'Optimisation Globale Centre d'Etudes de la Navigation A erienne 7, av Edouard Belin 31055 Toulouse Cedex Fran e durand re her he.ena .fr tel: (33) 562 17 40 54 Jean-Mar Alliot Laboratoire d'Optimisation Globale Centre d'Etudes de la Navigation A erienne 7, av Edouard Belin 31055 Toulouse Cedex Fran e alliot re her he.ena .fr tel: (33) 562 17 41 24 Abstra t It is usu...
متن کاملIndian Iris Image Segmentation using Nelder-Mead Simplex Method
In this paper, we describe a new approach of employing Nelder-Mead optimization (NMO) simplex method in Iris image segmentation. In this paper we are using modified way of Libor masek method. In modified Libor masek method mainly in preprocessing phase in segmentation we are using Nelder-Mead search method also called as simplex method for calculation of center coordinates, radius and threshold...
متن کاملGrid Restrained Nelder-Mead Algorithm
Probably the most popular algorithm for unconstrained minimization for problems of moderate dimension is the Nelder-Mead algorithm published in 1965. Despite its age only limited convergence results exist. Several counterexamples can be found in the literature for which the algorithm performs badly or even fails. A convergent variant derived from the original Nelder-Mead algorithm is presented....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics
سال: 2013
ISSN: 1303-5991
DOI: 10.1501/commua1_0000000698